Unions of Perfect Matchings in Cubic Graphs and Implications of the Berge-Fulkerson Conjecture
نویسنده
چکیده
The Berge-Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is in exactly two of the perfect matchings. If the Berge-Fulkerson Conjecture is true, then what can we say about the proportion of edges of a cubic bridgeless graph that can be covered by k of its perfect matchings? This is the question we address in this paper. We then give a possible method for proving, independently of the Berge-Fulkerson Conjecture, the bounds obtained.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملA note on Berge-Fulkerson coloring
The Berge–Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is contained in exactly two of these perfect matchings. In this paper, a useful technical lemma is proved that a cubic graph G admits a Berge–Fulkerson coloring if and only if the graph G contains a pair of edge-disjoint matchings M1 and M2 such that (i) M1 ∪ M2 in...
متن کاملBerge-Fulkerson coloring for infinite families of snarks
It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. Hägglund constructed two graphs Blowup(K4, C) and Blowup(Prism,C4). Based on these two graphs, Chen constructed infinite families of bridgeless cubic graphs M0,1,2,...,k−2,k−1 which is obtained from cyclically 4-edge-connected and having a...
متن کاملPerfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture
Let m∗t be the largest rational number such that every bridgeless cubic graph G associated with a positiveweightω has t perfectmatchings {M1, . . . ,Mt}withω(∪i=1 Mi) ≥ m ∗ t ω(G). It is conjectured in this paper that m∗3 = 4 5 , m ∗ 4 = 14 15 , and m ∗ 5 = 1, which are called the weighted PM-covering conjectures. The counterparts of this new invariant m∗t and conjectures for unweighted cubic g...
متن کاملCovering a cubic graph by 5 perfect matchings
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs with a circuit missing only one vertex and bridgeless cubic graphs with a 2-factor consisting of two circuits. The first part of this result implies that Berge ...
متن کامل